The Number of the Two Dimensional Run Length Constrained Arrays
نویسندگان
چکیده
First, a new framework describing the transfer matrices for the two dimensional run length constrained arrays (codes) is introduced, and some important properties of the transfer matrices ( 1) m T m are derived in this framework. Then, using these properties, it is shown that the numbers ( , ) ( , 1) N m n m n of the two dimensional binary arrays satisfying the (1, ) run length constraint is expressible by a linear recurrence equation of a fixed order, approximately equal to dim( ) 2 m T . Finally, to demonstrate the effectiveness of the result obtained, some numerical examples are presented.
منابع مشابه
Iterated Local Search Algorithm for the Constrained Two-Dimensional Non-Guillotine Cutting Problem
An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...
متن کاملPartial characterization of the positive capacity region of two-dimensional asymmetric run length constrained channels
A binary sequence satisfies a one-dimensional (d; k) run length constraint if every run of zeros has length at least d and at most k. A two-dimensional binary pattern is (d1; k1; d2; k2)-constrained if it satisfies the one-dimensional (d1; k1) run length constraint horizontally and the one-dimensional (d2; k2) run length constraint vertically. For given d1; k1; d2, and k2, the asymmetric two-di...
متن کاملOn the capacity of two-dimensional run-length constrained channels
Two-dimensional binary patterns that satisfy onedimensional (d; k) run-length constraints both horizontally and vertically are considered. For a given d and k, the capacity Cd; k is defined as Cd; k = limm;n!1 log2N (d; k) m;n =mn, where N (d; k) m;n denotes the number of m n rectangular patterns that satisfy the two-dimensional (d; k) run-length constraint. Bounds on Cd; k are given and it is ...
متن کاملMechanical behaviour of motion for the two-dimensional monolayer system
In this paper we study the dynamics of the 2D-motion of a particle of monolayer. First we consider the usual physical time component and the plan manifold R2, having the polar coordinates. Then a geometric approach to nonholonomic constrained mechanical systems is applied to a problem from the two dimensional geometric dynamics of the Langmuir-Blodgett monolayer. We consider a constraint sub...
متن کاملA Chance Constrained Model for a Two Units Series Critical System Suffering From Continuous Deterioration
In this paper we focus on a continuously deteriorating two units series equipment which its failure can not be measured by cost criterion. For these types of systems avoiding failure during the actual operation of the system is extremely important. In this paper we determine inspection periods and maintenance policy in such a way that failure probability is limited to a pre-specified value and ...
متن کامل